class Solution {
public:
    bool IsContinuous( vector<int> numbers ) {
        if(numbers.empty())
            return false;
        sort(numbers.begin(), numbers.end());
        //去掉0
        int i=0;
        while(numbers[i]==0)
            i++;
        //如果有重复的
        for(int k=i+1;k<numbers.size();k++)
        {
            if(numbers[k]==numbers[k-1])
                return false;
        }
        //5个数字，最大值和最小值的差不超过4
        if(numbers.back()-numbers[i]>4)
            return false;
        return true;
    }
};